Optimal diameter assignment for gas pipeline networks
نویسندگان
چکیده
منابع مشابه
Optimal Energy Consumption Analysis of Natural Gas Pipeline
There are many compressor stations along long-distance natural gas pipelines. Natural gas can be transported using different boot programs and import pressures, combined with temperature control parameters. Moreover, different transport methods have correspondingly different energy consumptions. At present, the operating parameters of many pipelines are determined empirically by dispatchers, re...
متن کاملOptimal Design of Offshore Natural-Gas Pipeline Systems
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملOptimal capacity assignment in general queueing networks
We consider the problem of how best to assign the service capacity in a queueing network in order to minimise the expected delay under a cost constraint. We study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting time dist...
متن کاملOn an Optimal Algorithm for Channel Assignment in Cellular Networks
A cellular network is often modelled as a graph and the channel assignment problem is formulated as a coloring problem of the graph. In a recent paper [16], we introduced the notion of cellular graphs that models the hexagonal cell structure of a cellular network. Assuming a k-band buffering system where the interference does not extend beyond k cells away from the call originating cell, we pro...
متن کاملA Near-optimal Slot Assignment Algorithm for RFID Reader Networks
In this paper, we propose a method that reduces the cycle time of RFID reader networks by overlapping slots. A mathematical formulation of the problem is specified and an effective heuristic algorithm is developed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1979
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000002009